Circumscribing DL-Lite
نویسندگان
چکیده
Classical logics (and hence Description Logics) are monotonic: the set of conclusions increases monotonically with the set of premises. Instead, common-sense reasoning is characterized as non-monotonic: new information can invalidate some of the previously made conclusions. Circumscription is one of the main nonmonotonic formalisms whose idea is to minimize (circumscribe) the extension of given predicates. In this paper we study circumscribed DL-Lite knowledge bases and show how to compute circumscription of a single predicate (either a concept or a role) in a DL-Litebool knowledge base. Unlike other works on circumscribed Description Logics KBs, we are interested not only in checking entailment, but actually in computing circumscription itself. We show that circumscription of a role in DL-Litebool requires the language of ALCHOIQ extended with union or roles, thus is first-order expressible.
منابع مشابه
Non Defeated-Based Repair in Possibilistic DL-Lite Knowledge Bases
Possibilistic DL-Lite is an extension of the DL-Lite framework to deal with uncertain pieces of information. In this paper, we deal with inconsistency in DL-Lite in case where the assertions are uncertain and encoded in a possibility theory framework. We investigate three inconsistency-tolerant reasoning methods for possibilistic DL-Lite knowledge bases which are based on the selection of one c...
متن کاملCapturing Instance Level Ontology Evolution for DL-Lite
Evolution of Knowledge Bases (KBs) expressed in Description Logics (DLs) proved its importance. Recent studies of the topic mostly focussed on model-based approaches (MBAs), where an evolution (of a KB) results in a set of models. For KBs expressed in tractable DLs, such as DL-Lite, it was shown that the evolution suffers from inexpressibility, i.e., the result of evolution cannot be expressed ...
متن کاملA Distance-Based Paraconsistent Semantics for DL-Lite
DL-Lite is an important family of description logics. Recently, there is an increasing interest in handling inconsistency in DL-Lite as the constraint imposed by a TBox can be easily violated by assertions in ABox in DL-Lite. In this paper, we present a distance-based paraconsistent semantics based on the notion of feature in DL-Lite, which provides a novel way to rationally draw meaningful con...
متن کاملRevision of DL-Lite Knowledge Bases
We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has received much attention in the ontology management and DL communities, but the existing proposals are restricted in several ways. In this paper we develop a formal framework for revision of DL-Lite KBs, using techniques that are analogous to those for model-based revision in propositional log...
متن کاملWSML Deliverable D 20 . 1 v 0 . 2 OWL −
This deliverable presents restricted variants of the OWL Lite, DL and Full species of the OWL ontology language, called OWL Lite−, OWL DL− and OWL Full−, respectively. OWL Lite− and OWL DL− are strict subsets of OWL Lite and OWL DL. They are limited in such a way that there exists a translation from both languages directly into the deductive database language Datalog. Thus, any OWL Lite− or OWL...
متن کامل